Toward memory scalability ofGYSELAcode for extreme scale computers
نویسندگان
چکیده
منابع مشابه
Scalability of Finite Element Applications on Distributed-memory Parallel Computers Scalability of Finite Element Applications on Distributed-memory Parallel Computers
This paper demonstrates that scalability and competitive eeciency can be achieved for unstructured grid nite element applications on distributed memory machines, such as the Connection Machine CM-5 system. The eeciency of nite element solvers is analyzed through two applications: an implicit computational aerodynamics application and an explicit solid mechanics application. Scalability of mesh ...
متن کاملNSIM: An Interconnection Network Simulator for Extreme-Scale Parallel Computers
In the near future, interconnection networks of massively parallel computer systems will connect more than a hundred thousands of computing nodes. The performance evaluation of the interconnection networks can provide real insights to help the development of efficient communication library. Hence, to evaluate the performance of such interconnection networks, simulation tools capable of modeling...
متن کاملArchitecture Scalability of Parallel Vector Computers with a Shared Memory
Based on a model of a parallel vector computer with a shared memory, its scalability properties are derived. The processor-memory interconnection network is assumed to be composed of crossbar switches of size b b. This paper analyzes sustainable peak performance under optimal conditions, i.e., no memory bank conflicts, sufficient processor-memory bank pathways, and no interconnection network ...
متن کاملToward a Memory-Centric, Stacked Architecture for Extreme-Scale, Data-Intensive Computing
One of the primary concerns of performing efficient data-intensive computing at scale is the inherent ability to exploit memory bandwidth on a local and global scale. The traditional computer architecture inherently decouples the processing interconnect from the memory interconnect, thus preventing efficient, parallel utilization of both at scale. Further, the orthogonal nature of these board-l...
متن کاملScalability Analysis of CGLS Algorithm for Sparse Least Squares Problems on Massively Distributed Memory Computers
In this paper we study the parallelization of CGLS, a basic iterative method for large and sparse least squares problems whose main idea is to organize the computation of conjugate gradient method to normal equations. A performance model of computation and communication phases with isoeeciency concept are used to analyze the qualitative scalability behavior of this method implemented on massive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2014
ISSN: 1532-0626
DOI: 10.1002/cpe.3429